翻訳と辞書 |
Lander–Green algorithm : ウィキペディア英語版 | Lander–Green algorithm The Lander–Green algorithm is an algorithm, due to Eric Lander and Philip Green for computing the likelihood of observed genotype data given a pedigree. It is appropriate for relatively small pedigrees and a large number of markers. It is used in the analysis of genetic linkage.〔Lander, E.S. and Green, P. (1987) ("Construction of multilocus genetic linkage maps in humans" ), ''Proceedings of the National Academy of Sciences'', 84 (8), 2363–2367〕〔 Abecasis, G.R., Wigginton, J.E. (2005) ("Handling Marker-Marker Linkage Disequilibrium: Pedigree Analysis with Clustered Markers" ), ''Am J Hum Genet.'', 77(5), 754–767. 〕 ==References== 〔
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Lander–Green algorithm」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|